Regularized bi-directional co-clustering

نویسندگان

چکیده

The simultaneous clustering of documents and words, known as co-clustering, has proved to be more effective than one-sided in dealing with sparse high-dimensional datasets. By their nature, text data are also generally unbalanced directional. Recently, the von Mises–Fisher (vMF) mixture model was proposed handle while harnessing directional nature text. In this paper, we propose a general co-clustering framework based on matrix formulation vMF model-based co-clustering. This leads flexible for that can easily incorporate both word–word semantic relationships document–document similarities. contrast existing methods, which use an additive incorporation similarities, bi-directional multiplicative regularization better encapsulates underlying structure. Extensive evaluations various real-world datasets demonstrate superior performance our approach over baseline competitive terms results co-cluster topic coherence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularized Co-Clustering on Manifold

Co-clustering is to partition rows and columns of a matrix simultaneously. It has been an important research field in data mining and machine learning. It is preferred over traditional homogeneous clustering techniques in many real applications. In this paper, we present a co-clustering algorithm based on local information and regularization. The algorithm seeks to preserve the local intrinsic ...

متن کامل

Co-regularized PLSA for Multi-view Clustering

Multi-view data is common in a wide variety of application domains. Properly exploiting the relations among different views is helpful to alleviate the difficulty of a learning problem of interest. To this end, we propose an extended Probabilistic Latent Semantic Analysis (PLSA) model for multi-view clustering, named Co-regularized PLSA (CoPLSA). CoPLSA integrates individual PLSAs in different ...

متن کامل

Co-regularized Multi-view Spectral Clustering

In many clustering problems, we have access to multiple views of the data each of which could be individually used for clustering. Exploiting information from multiple views, one can hope to find a clustering that is more accurate than the ones obtained using the individual views. Often these different views admit same underlying clustering of the data, so we can approach this problem by lookin...

متن کامل

Co-regularized Spectral Clustering with Multiple Kernels

We propose a co-regularization based multiview spectral clustering algorithm which enforces the clusterings across multiple views to agree with each-other. Since each view can be used to define a similarity graph over the data, our algorithm can also be considered as learning with multiple similarity graphs, or equivalently with multiple kernels. We propose an objective function that implicitly...

متن کامل

Regularized Co-Clustering with Dual Supervision

By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive performance improvements over traditional one-sided row clustering techniques. A good clustering of features may be seen as a combinatorial transformation of the data matrix, effectively enforcing a form of regularization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics and Computing

سال: 2021

ISSN: ['0960-3174', '1573-1375']

DOI: https://doi.org/10.1007/s11222-021-10006-w